Reversible session-based pi-calculus

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reversible session-based pi-calculus

In this work, we incorporate reversibility into structured communication-based programming, to allow parties of a session to automatically undo, ina rollback fashion, the effect of previously executed interactions. This per-mits to take different computation paths along the same session, as wellas to revert the whole session and starting a new one. Our aim is to de-fine a th...

متن کامل

Session-based Type Discipline for Pi Calculus with Matching

does not allow the transmission of an arbitrary channel. In most situations a receiving process k?(k′′).Q can be alpha-converted ahead of communication so that the bound channel k′′ syntactically matches the free channel k′ in the object of the sending process [11]. The exception happens exactly when k′ is free in Q: alpha-conversion becomes impossible (for it would capture the free variable k′...

متن کامل

Linearity, session types and the Pi calculus

We present a reconstruction of session types in a conventional pi calculus. Our session types are qualified as linear or unrestricted. Linearly typed communication channels are guaranteed to occur in exactly one thread, possibly multiple times; afterwards they evolve to unrestricted channels. We equip types with a constructor that describes the two ends of a same communication channel, and prop...

متن کامل

A Linear Account of Session Types in the Pi Calculus

We present a reconstruction of session types in a conventional pi calculus where types are qualified as linear or unrestricted. Linearly typed communication channels are guaranteed to occur in exactly one thread, possibly multiple times. We equip types with a constructor that denotes the two ends of a same communication channel. In order to assess the flexibility of the new type system, we prov...

متن کامل

Reversible Semantics in Session-based Concurrency

Much research has studied foundations for correct and reliable communication-centric systems. A salient approach to correctness uses session types to enforce structured communications; a recent approach to reliability uses reversible actions as a way of reacting to unanticipated events or failures. This note describes recent work that develops a simple observation: the machinery required to def...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Logical and Algebraic Methods in Programming

سال: 2015

ISSN: 2352-2208

DOI: 10.1016/j.jlamp.2015.03.004